Eigenvalues and nonsmooth optimization

نویسنده

  • Adrian Lewis
چکیده

Variational analysis concerns the geometry and calculus of nonsmooth sets and functions, often viewed from an optimization perspective. Over several decades, variational analysis has matured into a powerful and elegant theory. One rich source of concrete examples involves the eigenvalues of symmetric and nonsymmetric matrices, sometimes deriving from dynamical or feedback control questions. This essay presents some central ideas of variational analysis, developed from first principles, including convexity and duality, generalized gradients, sensitivity, Clarke regularity, and numerical nonsmooth optimization. Illustrative examples from eigenvalue optimization, many from joint work with J.V. Burke and M.L. Overton, include semidefinite programming, asymptotic stability, simultaneous plant stabilization, and the distance to instability.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient one-layer recurrent neural network for solving a class of nonsmooth optimization problems

Constrained optimization problems have a wide range of applications in science, economics, and engineering. In this paper, a neural network model is proposed to solve a class of nonsmooth constrained optimization problems with a nonsmooth convex objective function subject to nonlinear inequality and affine equality constraints. It is a one-layer non-penalty recurrent neural network based on the...

متن کامل

Sufficiency and duality for a nonsmooth vector optimization problem with generalized $alpha$-$d_{I}$-type-I univexity over cones‎

In this paper, using Clarke’s generalized directional derivative and dI-invexity we introduce new concepts of nonsmooth K-α-dI-invex and generalized type I univex functions over cones for a nonsmooth vector optimization problem with cone constraints. We obtain some sufficient optimality conditions and Mond-Weir type duality results under the foresaid generalized invexity and type I cone-univexi...

متن کامل

Analysis of a Belgian Chocolate Stabilization Problem

We give a detailed numerical and theoretical analysis of a stabilization problem posed by V. Blondel in 1994. Our approach illustrates the effectiveness of a new “gradient sampling” algorithm for finding local optimizers of nonsmooth, nonconvex optimization problems arising in control, as well as the power of nonsmooth analysis for understanding variational problems involving polynomial roots a...

متن کامل

Optimality conditions for Pareto efficiency and proper ideal point in set-valued nonsmooth vector optimization using contingent cone

In this paper, we first present a new important property for Bouligand tangent cone (contingent cone) of a star-shaped set. We then establish optimality conditions for Pareto minima and proper ideal efficiencies in nonsmooth vector optimization problems by means of Bouligand tangent cone of image set, where the objective is generalized cone convex set-valued map, in general real normed spaces.

متن کامل

A General Scalar-Valued Gap Function for Nonsmooth Multiobjective Semi-Infinite Programming

For a nonsmooth multiobjective mathematical programming problem governed by infinitely many constraints‎, ‎we define a new gap function that generalizes the definitions of this concept in other articles‎. ‎Then‎, ‎we characterize the efficient‎, ‎weakly efficient‎, ‎and properly efficient solutions of the problem utilizing this new gap function‎. ‎Our results are based on $(Phi,rho)-$invexity‎,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005